NON-POINTED EXACTNESS, RADICALS, CLOSURE OPERATORS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-pointed Exactness, Radicals, Closure Operators

In this paper it is shown how non-pointed exactness provides a framework which allows a simple categorical treatment of the basics of KuroshAmitsur radical theory in the non-pointed case. This is made possible by a new approach to semi-exactness, in the sense of the first author, using adjoint functors. This framework also reveals how categorical closure operators arise as radical theories.

متن کامل

From torsion theories to closure operators and factorization systems

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

متن کامل

Fuzzy Closure Systems and Fuzzy Closure Operators

We introduce fuzzy closure systems and fuzzy closure operators as extensions of closure systems and closure operators. We study relationships between fuzzy closure systems and fuzzy closure spaces. In particular, two families F (S) and F (C) of fuzzy closure systems and fuzzy closure operators on X are complete lattice isomorphic.

متن کامل

Regular closure operators

In an 〈E,M 〉-category X for sinks, we identify necessary conditions for Galois connections from the power collection of the class of (composable pairs) of morphisms in M to factor through the “lattice” of all closure operators on M , and to factor through certain sublattices. This leads to the notion of regular closure operator. As one byproduct of these results we not only arrive (in a novel w...

متن کامل

Closure Operators and Subalgebras

In this article we present several logical schemes. The scheme SubrelstrEx concerns a non empty relational structure A, a set B, and a unary predicate P, and states that: There exists a non empty full strict relational substructure S of A such that for every element x of A holds x is an element of S if and only if P[x] provided the following conditions are met: • P[B], • B ∈ the carrier of A. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 2013

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788713000086